The Real Dimension Problem Is NPR-Complete
نویسندگان
چکیده
منابع مشابه
The Real Dimension Problem Is Np R -complete Ecole Normale Supérieure De Lyon the Real Dimension Problem Is Np R -complete R Esum E the Real Dimension Problem Is Np R -complete
We show that computing the dimension of a semi-algebraic set of R n is a NP R-complete problem in the Blum-Shub-Smale model of computation over the reals. Since this problem is easily seen to be NP R-hard, the main ingredient of the proof is a NP R algorithm for computing the dimension. On montre que le calcul de la dimension d'un ensemble semi-alg ebrique de R n est un probl eme NP R-complet d...
متن کاملThe Real Dimension Problem
We show that computing the dimension of a semi-algebraic set of R n is a NP R-complete problem in the Blum-Shub-Smale model of computation over the reals. Since this problem is easily seen to be NP R-hard, the main ingredient of the proof is a NP R algorithm for computing the dimension.
متن کاملDeciding the Vapnik-Cervonenkis dimension is ...-complete
Linial et al. raised the question of how diicult the computation of the Vapnik-ervonenkis dimension of a concept class over a nite universe is. Papadmimitriou and Yannakakis obtained a rst answer using matrix representations of concept classes. We choose a more natural representation , which leads us to redeene the vc dimension problem. We establish that vc dimension is p 3-complete, thereby gi...
متن کاملDeciding the K-Dimension is PSPACE-Complete
In 1988 Littlestone introduced the optimal mistake-bound learning model to learning theory. In this model the difficulty of learning a concept from a concept class is measured by the K-dimension of the concept class, which is a purely combinatorial notion. This is similar to the situation in PAC-learning, where the difficulty of learning can be measured by the Vapnik-Červonenkis dimension. We s...
متن کاملPlanar Metric Dimension is NP-complete
We show that Metric Dimension on planar graphs is NP-complete.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complexity
سال: 1999
ISSN: 0885-064X
DOI: 10.1006/jcom.1999.0502